Determining a route advertisement in a reactive routing environment

ABSTRACT

In an example embodiment, a method and system is provided to determine and advertise a route advertisement in a reactive routing environment. In response to receiving a network address query with respect to a destination address at a routing device, an aggregate value, e.g. an address prefix, is determined and advertised in reply to the network address query. Determining of the aggregate value may comprise identifying within a range of network addresses represented by the aggregate value respective addresses for which the routing device does not have reachability information. The routing device may send address queries with respect to the identified addresses, to determine reachability via the routing device of those addresses. The aggregate value may be advertised conditional upon determining that a percentage of addresses within the corresponding range that can be reached via the routing device satisfies a predefined minimal coverage value.

CLAIM OF PRIORITY

This application is a continuation of and claims the benefit of priorityunder 35 U.S.C. §120 to U.S. patent application Ser. No. 11/949,561,filed on Dec. 3, 2007, which is hereby incorporated by reference hereinin its entirety.

FIELD

This application relates to an apparatus and method for broadcasting anetwork address in a reactive routing environment.

BACKGROUND

Systems and methods implemented in a reactive routing environment mayutilize various protocols and principles, whereby network apparatus(e.g., network node, network device, router, switch, or other networkappliance) react to certain broadcast messages. These broadcast messagesmay include generally the broadcasting of network addresses (e.g.,Internet Protocol (IP) addresses), or the request for such addresses.The reactions on the part of the apparatus may range from doing nothing,to broadcasting responses to these messages. In certain examples, thebroadcast messages are generated unilaterally and not as part of areaction on the part of an apparatus.

BRIEF DESCRIPTION OF DRAWINGS

The present method and apparatus is illustrated by way of example andnot limitation in the figures of the accompanying drawings, in whichlike references indicate similar elements and in which:

FIG. 1 is a diagram of a system, according to an example embodiment,illustrating the querying of an apparatus in an inter-network context.

FIG. 2 is a diagram of a system, according to an example embodiment,illustrating a subsequent query by a second apparatus in response to aquery provided by a first apparatus.

FIG. 3 is a diagram of a system, according to an example embodiment,illustrating a response provided by the first apparatus to the secondapparatus as a response to an initial query generated by the firstapparatus.

FIG. 4 is a diagram of a system, according to an example embodiment,illustrating the generation of an aggregate value within theintra-network context.

FIG. 5 is a block diagram of an apparatus, according to an exampleembodiment, that generates an aggregate value, and some of the variousblocks of functionality associated therein.

FIG. 6 is a block diagram of an apparatus, according to an exampleembodiment, that receives an aggregate value, and some of the variousblocks of functionality associated therein.

FIG. 7 is a flow chart illustrating a method, according to an exampleembodiment, to generate an aggregate value.

FIG. 8 is a flow chart illustrating a method, according to an exampleembodiment, to generate a range of network addresses form an aggregatevalue.

FIG. 9 is a tri-stream flowchart illustrating a method, according to anexample embodiment, relating to the generation of a query aggregatevalue and the subsequent generation of a range of network address valuesbased upon the aggregate value.

FIG. 10 is a diagram of a configuration of instruction set, according toan example embodiment.

FIG. 11 is a flowchart illustrating a method, according to an exampleembodiment, used to implement an operation to find the closest smallestaddress value.

FIG. 12 is a flowchart illustrating a method, according to an exampleembodiment, used to implement an operation to determine missing addressvalues in a routing table.

FIG. 13 is a flowchart illustrating a method, according to an exampleembodiment, used to implement an operation to determine and generate anadvertised aggregated value using a termination condition.

FIG. 14 is a flowchart illustrating a method, according to an exampleembodiment, used to implement an operation that updates a routing table.

FIG. 15 shows a diagrammatic representation of machine, according to anexample embodiment, in the form of a computer system.

DESCRIPTION OF EXAMPLE EMBODIMENTS

In the following description, for purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of an embodiment of the present method and apparatus. Itmay be evident, however, to one skilled in the art, that the presentmethod and apparatus may be practiced without these specific details.

Overview

In an example embodiment, a method is provided. In this method, anetwork address query is received. A first network address of a knownapparatus is retrieved from a routing table, in response to the networkaddress query. A second network address may be determined based upon thenetwork address query, the second network address having a smaller bitlength than the first network address. An aggregate value may beadvertised that represents a range of reachable network addresses, therange of reachable network addresses including the second networkaddress.

Some example embodiments may include a method. This method may includereceiving an aggregate value, with a prefix, that represents a range ofreachable network addresses. A comparison may take place comparing theprefix of the aggregate value to a prefix of a network address query,the comparing being based upon a logical operation. A network addressvalue may then be generated, where the prefix of the network addressquery and the prefix of the aggregate value are equal.

EXAMPLE EMBODIMENTS

In some example embodiments, an apparatus and method are illustratedthat leverage certain properties of binary numbers in the reactiverouting environment to optimize the scalability of a network. Thisoptimization may occur simultaneously with a reduction in the usage ofbandwidth during the advertisement of network addresses. These networkaddresses may be IP addresses, Media Access Control (MAC) addresses, orother suitable network addresses. Further, these network addresses maybe illustrated as part of an Open Systems Interconnection BasicReference (OSI) model, or Transmission Control Protocol/InternetProtocol (TCP/IP) stack model. Some example embodiments may include theuse of address masking in combination with a network address. In anexample embodiment, an apparatus, which is attempting to advertise anaddress space that may overlap with other addresses already advertisedin the network, uses a method for ensuring that overlapping addressspaces are properly tracked. This method uses the capability of queryingfor reachable destinations available in all reactive routingenvironments.

For example, when an apparatus receives a query for a specificdestination, the apparatus may examine its local routing table, anddetermine the shortest prefix route which it may reply. The apparatuscan then determine the shortest length prefix by comparing the reachabledestinations within progressively shorter prefixes against a coveragepercentage, which can be referred to as a minimal coverage value. Aminimal coverage value may be a value reflecting a percentage ofreachable destinations, where each reachable destination is denoted by anetwork address. When the apparatus finds a possible aggregate valuecovering a range of reachable network addresses, the apparatus can thensend queries requesting information regarding the portions of theaddress space about which it does not have information. An aggregatevalue may be a network address stated using a shortened (e.g., statedusing 30-bits instead of 32-bits) network address prefix. If theapparatus discovers reachability information for a minimal coveragevalue, which can be referred to as the “aggregate coverage,” theapparatus may advertise an aggregate value, rather than more specificrouting information. As an apparatus obtains information about losses inreachability, either through timing routes out, or through newlyreceived routing information, the apparatus can examine the advertisedaggregate value. In some examples, routing information may be removed,or otherwise withdrawn. If a specific apparatus no longer has routes toall the components of an advertised aggregate, the apparatus removes theaggregated value, and advertises components of the aggregate value. Insome example embodiments, the amount of coverage required may be 100%.That is, an apparatus is able to reach all the destinations within anaggregate value to advertise the aggregate value. It may, however, bepossible to envision networks where 100% coverage is not required.

In some example embodiments, certain properties of binary numbers andeven logic are utilized to generate the aggregate value. Throughapplying Classless Inter-Domain Routing (CIDR) notation, a networkaddress may be represented as 10.1.1.65/32, where the address 10.1.1.65is represented as a 32 bit value. In an example, this network addressmay be joined with a second network address of 10.1.1.64/30 using alogical “AND” operation such that the resulting network address mayreveal a range of additional network addresses. This second networkaddress may be an aggregate value. The following is an example of this“AND” operation being applied to the first and second network addressesin their binary form:

1010.1.1 . . . 1000001

AND 1010.1.1 . . . 1000000

1010.1.1 . . . 1000000

Once this “AND” operation is applied to the first and second networkaddresses, the resulting value is compared against the first 30 digitsof the first network address. Where the values match, a range of addressvalues may be generated based upon the remaining bit positions for whicha binary value was not generated. In the present example, the range ofaddress values may be generated for the 31^(st) and 32^(nd) bitpositions such that the following values may be generated:10.1.1.64/32 as 1010.1.1 . . . 100000010.1.1.65/32 as 1010.1.1 . . . 100000110.1.1.66/30 as 1010.1.1 . . . 100001010.1.1.67/30 as 1010.1.1 . . . 1000011As illustrated above, these ranges of address values created bycomparing the query address and the aggregate value allow the firstapparatus to learn the network addresses reachable by the secondapparatus, without having to be provided each of these addressesseparately. Further, rather than having to be provided a 32-bit value asa response to the query, the first apparatus can be provided a smallernetwork address as an aggregate value that still covers a range ofaddresses. A smaller network address may be a network address that is30-bits long instead of 32-bits long. Some example embodiments mayinclude using less bandwidth, for rather than having to transmit aplurality of address in response to an initial query, a single aggregatevalue may be transmitted. Further, through comparing the query addressand the aggregate value, optimal routing table sizes may be generatedand used, black holes in a network may be avoided, and topologydependence may be avoided.

In an example implementation, assume a single apparatus in a reactivenetwork has a routing table including the following network addresses:

10.1.1.65/3210.1.1.66/3210.1.1.68/3210.1.1.70/32The apparatus receives a query for routing information for 10.1.1.65, inresponse to the query, the apparatus examines its local routing table,and discovers it has a route to 10.1.1.65/32 that would providereachability to this destination (e.g., 10.1.1.65/32). Rather thananswering with this route, however, the apparatus examines the adjoiningrouting table entries, to determine if a shorter prefix may beadvertised. The apparatus first determines that if the apparatus couldfind reachability to 10.1.1.64/32, then the apparatus could advertise10.1.1.64/31, which would include the addresses 10.1.1.64 and 10.1.1.65.Next, the apparatus sends out a query, and receives a reply that10.1.1.64/32 is reachable through some connected interface. If theapparatus could reach 10.1.1.67/32, then the apparatus could advertise10.1.1.6430 as an aggregate value. By advertising 10.1.1.64, theapparatus could in effect advertise addresses 10.1.1.64 through10.1.1.67. Again, the apparatus sends out a query, and finds a path to10.1.1.67. If the apparatus could find reachability to 10.1.1.69 and10.1.1.71, then the apparatus could advertise 10.1.1.64/29 as anaggregate value. This address 10.1.1.64/29 may include addresses10.1.1.64 through 10.1.1.71. The apparatus then queries for reachabilityto 10.1.1.69, and if the apparatus does not receive a reply, then theapparatus advertises 10.1.1.64/30 as an aggregate value.

In some example embodiments, the above illustrated implementation mayalso include the ability to not attempt to advertise a shorter prefixlength route. For instance, if less than some percentage of the addressspace is already known, or the advertised prefix length is already belowsome length, the apparatus may choose to simply advertise the route asknown. Further, the process used may vary from a “recursive” or“cyclical” process, as illustrated above, to a process where queries forall the missing address space are all sent at once. In examples whereall address space information is requested at once, a particularaggregate value may be advertised when the queries have been completed.

FIG. 1 is a diagram of an example system 100 illustrating the queryingof an apparatus in an inter-network context. Illustrated is a Region A101 that includes a number of apparatuses such as apparatuses 103-106.These apparatuses may be, for example, routers, bridges, switches, orsome other suitable network appliance. Illustrated herein is anapparatus 103 that is operatively coupled to an apparatus 104. Thisapparatus 104 is, in turn, operatively coupled to an apparatus 106,which is operatively coupled to an apparatus 105. As illustrated here,apparatus 106 operates as, for example, a gateway apparatus. Alsoillustrated is a Region B 102 that includes a number of apparatuses suchas apparatuses 107-110. Included within this Region B 102 are a numberof apparatuses, including, for example, apparatus 110, apparatus 109,apparatus 108, and apparatus 107. Apparatus 107, in this example, mayact as a second gateway apparatus. Further, apparatus 107 is operativelycoupled to apparatus 108 and apparatus 109, whereas apparatus 109 isoperatively coupled to apparatus 110. Further, apparatus 107 isoperatively coupled to apparatus 106. Additionally, FIG. 1 shows anetwork address query 111 that is generated and sent by the apparatus106 across a network connection to the apparatus 107. A network addressquery may be a data packet broadcast by an apparatus seeking networkaddress information. Included within this network address query 111 is anetwork address (e.g., a query address) of 10.1.1.65/32. Once thisnetwork address query 111 is received by the apparatus 107, apparatus107 examines its routing table and determines any gaps or missing valuesin this routing table.

Based upon the discovery of gaps in the routing table, the apparatus107, in turn, sends out additional queries 112, and 114 to the apparatusto which the apparatus 107 is operatively connected (e.g., apparatus108, apparatus 109). Here, for example, included within each one ofthese queries 112 is a network address 10.1.1.64, which is a number oneless than the original network address query 111. Specifically, whereasnetwork address query 111 seeks information with regard to the address10.1.1.65 as a 32-bit value, apparatus 107 seeks information with regardto 10.1.1.64 as a 32-bit value. As will be illustrated below, thisprocess of sending out queries to fill the gaps in routing table ofapparatus 107 may continue until a termination condition is met, such aswhen no response is received from the apparatuses (e.g., apparatus 108and apparatus 109) to which apparatus 107 is operatively connected. Inthe alternative, this process may continue until queries are sent outfor a range of network addresses predetermined by the apparatus 107, andresponses are received or not received in reply. Still further, an emptyreply packet may be received from the apparatuses (e.g., apparatus 108and apparatus 109) denoting that no further address information isavailable. Collectively, apparatuses 103 through 110 may be a networknode, network device, router, switch, or other suitable networkappliance.

FIG. 2 is a diagram of an example system 200 illustrating a subsequentquery by the previously illustrated apparatus 107 in response to thenetwork address query 111. FIG. 2 shows the apparatus 107 and aplurality of queries 201. In some example embodiments, the apparatus 107conducts an additional query of the apparatuses to which the apparatus107 is operatively connected. Here, for example, queries 201 includingthe query address 10.1.1.67 are sent to apparatus 108 and apparatus 109.In turn, apparatus 109 returns a response 203 including the queryaddress 10.1.1.67. Based upon this response 203, apparatus 107 may senda response to the apparatus 106 responding to the network address query111. This response may include, for example, the value 10.1.1.64 as a30-bit value such that this 30-bit value (e.g., 10.1.1.64/30 as 10.1.1 .. . 10000) could be an aggregate value. This aggregate value may then beprocessed by the apparatus 106 such that the values 10.1.1.64/32 through10.1.1.67/32 may be retrieved on an as-needed basis. Further, in someexamples, query 205 is sent from the apparatus 109 to the apparatus 110.As will be more fully shown below, however, based upon certainparameters regarding coverage percentage and bit size, the apparatus 107may make additional queries of the apparatus that are part of its RegionB 102. Specifically, apparatus 107 may query apparatus 109, andapparatus 109 may query apparatus 110. This process, in some exampleembodiments, may continue until no further apparatuses may be queried.

FIG. 3 is a diagram of an example system 300 illustrating a response 303provided by the apparatus 107 to the apparatus 106 in response to thenetwork address query 111. FIG. 3 shows an apparatus 107, a query 301and a response 303. In some example embodiments, an apparatus 107generates a query 301 that includes the address 10.1.1.69. This query301 is made, for example, because a gap may exist in the routing tablevalues included in the routing table for apparatus 107. Here, however,neither one of the queried apparatuses (e.g., apparatus 108 andapparatus 109) respond to the queries sent out by apparatus 107 (e.g.,query 301). Apparatus 107 then generates a response 303 including theaggregate value 10.1.1.64 as a 30-bit value (10.1.1.64/30). This 30-bitvalue, as previously shown above and in FIG. 2, includes an aggregatevalue that can be utilized by the apparatus 106 to generate a range ofnetwork address values 10.1.1.64 through 10.1.1.67 as 32-bit values.Apparatus 106 will then have network addresses for not only the initialquery address 10.1.1.65, but also for the network addresses 10.1.1.64through 10.1.1.67.

Ha 4 is a diagram of an example system 400 illustrating the generationof an aggregate value within the intra-network context. Illustrated is aRegion A 401 including a number of apparatuses 403-407, and apparatuses411-412, and various network address queries 408. As with FIGS. 1through 3, these apparatuses may be, for example, a router, bridge,switch, or some other suitable network appliance. In some exampleembodiments, an apparatus 403 is operatively connected to an apparatus404. This apparatus 404 is, in turn, operatively connected toapparatuses 402 and 405. Apparatus 405 is operatively connected toapparatus 406. Further illustrated is an apparatus 407 that isoperatively connected to the apparatus 403. This apparatus 407 is alsooperatively connected to apparatuses 412 and 411. In some exampleembodiments, apparatus 403 generates a query network address query 408including the query address 10.1.1.65 as a 32-bit value. In some exampleembodiments, this network address query 408 may be transmitted to otherapparatuses as well (e.g., apparatus 404), and forwarded by theseapparatuses (e.g., apparatus 404 forwarding to apparatus 402, andapparatus 405 forwarding to apparatus 406). Once received by theapparatus 407, this network address query 408 is processed such that itsaddress information is retrieved, and such that the apparatus 407generates additional queries 409 and 410 that are sent to apparatuses411, and 412 respectively. These additional queries 409 and 410 may begenerated because a gap exists in the routing table for the apparatus407. In response to the query 409, apparatus 412 may generate a response413 including the address value 10.1.1.64. Once this response 413 isreceived by the apparatus 407, apparatus 407 may generate a response tothe network address query 408 in the form of a response 414 includingthe aggregate value 10.1.1.64 as a 31-bit value. This response 414 isthen processed such that the value 10.1.1.64 as a 31-bit value is placedinto the routing table for apparatus 403 and, as a result, both10.1.1.64 and 10.1.65 as a 32-bit value may be generated from theaggregate value included within the response 414. The process for takingan aggregate value and using the aggregate value to generate a number ofadditional address values will be more fully illustrated below,

FIG. 5 is a block diagram of an example apparatus such as the apparatus107 and some of the various blocks of functionality associatedtherewith. These blocks may represent blocks of functionalityimplemented in hardware, firmware, or even software. As shown in FIG. 5,apparatus 107 includes a first receiver 501, a retriever 502, a firstcalculation engine 503, and a second receiver 504. Some exampleembodiments may include the apparatus 107 having a first receiver 501 toreceive a network address query. The apparatus 107 also includesretriever 502 to retrieve a first network address of a known apparatusfrom a routing table, this in response to the network address query. Afirst network address may be an IP address or some other suitablenetwork address. A known apparatus may be an apparatus whose networkaddress is listed in the routing table. Moreover, the apparatus 107 hasa first calculation engine 503 to determine a second network addressbased upon the network address query, where the second network addresshas a smaller bit length than the first network address. Additionally,the apparatus 107 has an advertising engine 504 to advertise anaggregate value that represents a range of reachable network addressesincluding the second network address. A reachable network address may bea network address of a further apparatus, where the further apparatusmay be reached with data. In addition, the first calculation engine 503may determine the second network address by a recursive operationperformed on the first network address. Further, first calculationengine 503 may determine the second network address based upon a minimalcoverage value. Also, the apparatus 107 may have a second receiver 505that may receive a response from a further apparatus, the responseconfirming a path to another apparatus based upon the second networkaddress. Additionally, the aggregate value may be a smaller bit lengththan the network query address query. Moreover, an insertion engine 506is shown to install the aggregate value into the routing table.

FIG. 6 is a block diagram of an example apparatus such as the apparatus106 and some of the various blocks of functionality associatedtherewith. These blocks may represent blocks of functionalityimplemented in hardware, firmware, or even software. As shown in FIG. 6,apparatus 106 includes receiver 601, comparison engine 602, addressgenerator 603, and insertion engine 604. Receiver 601 is configured toreceive an aggregate value, with a prefix, that represents a range ofreachable network addresses. Also, comparison engine 602 compares theprefix of the aggregate value to a prefix of a network address query,wherein the comparison is based upon a logical operation. Additionallyincluded is an address generator 603 to generate a network addressvalue, where the prefix of the network address query and the prefix ofthe aggregate value are equal. This address generator 603 may generatethe network address value based upon a minimal coverage value. Further,this address generator 603 may generate the network address valuethrough finding an address value that lies between the aggregate valueand the network address query. Also, this apparatus 106 may include aninsertion engine 604 to install the aggregate value into a routing tablethat is associated with the apparatus.

FIG. 7 is a flow chart illustrating an example method 700 to generate anaggregate value. The various operations 701-706 shown below may resideas part of the apparatus 107. Shown is a method that includes executingan operation 701 for receiving a network address query. Next, anoperation 702 is shown that, when executed, retrieves a first networkaddress of a known apparatus from a routing table, in response to thenetwork address query. Then, an operation 703 is executed to determine asecond network address based upon the network address query, the secondnetwork address having a smatter bit length than the first networkaddress. Operation 704 may be executed to advertise an aggregate valuethat represents a range of reachable network addresses including thesecond network address. The operation 703 may also be executed todetermine the second network address is performed by a recursiveoperation on the first network address. Also, this operation 703 mayalso be executed to determine whether the second network address isbased upon a minimal coverage value. An operation 705 may be executed toreceive a response from an apparatus, where the response confirms a pathto another apparatus based upon the second network address. Theaggregate value may be a smaller bit length than the network queryaddress query. An operation 706 may be executed to install the aggregatevalue into the routing table.

FIG. 8 is a flow chart illustrating an example method 800 to generate arange of network addresses from an aggregate value. The variousoperations 801-804 shown below may reside as a part of the apparatus106. Shown is an operation 801 that, when executed, receives anaggregate value, with a prefix, that represents a range of reachablenetwork addresses. Next, an operation 802 is illustrated that whenexecuted, compares the prefix of the aggregate value to a prefix of anetwork address query, where the comparing is based upon a logicaloperation. Further, an operation 803 is shown that, when executed,generates a network address value, where the prefix of the networkaddress query and the prefix of the aggregate value are equal. Moreover,this operation 803 may generate the network address value based upon aminimal coverage value. Also, this operation 803 may generate thenetwork address value that is performed through finding an address valuethat lies between the aggregate value and the network address query. Anoperation 804 is shown that, when executed, installs the aggregate valueinto a routing table that is associated with an apparatus. Below isillustrated a number of figures that provide a context for understandingthe operations shown in FIGS. 7 and 8.

FIG. 9 is a tri-stream flowchart illustrating an example method 900relating to the generation of an aggregate value and the subsequentgeneration of a range of network address values based upon the aggregatevalue. In some example embodiments, the functionality outlined below inthe form of the various operations may reside on the same of theapparatuses e.g., apparatus 106, apparatus 107, or apparatus 108), asopposed to being divided amongst two or more apparatuses as illustratedhere. Shown is a first stream titled “Member of Apparatus Region”illustrating operations 912-913, 915-917, and a routing table 914. Alsoshown is a second stream titled “Broadcasting Apparatus” illustratingoperations 902, 906-907, 909-910, 919-921, and a routing table 908. Athird stream titled “Querying Apparatus” is also shown that illustratesoperations 904, 923-924, 926, and routing table 925.

Starting with the “Broadcasting Apparatus” stream, a configurationinstruction set 901 is provided to, and processed by an operation 902.This configuration instruction set 901 configures a broadcastingapparatus, wherein this broadcasting apparatus may be, for example, oneof the previously illustrated gateway apparatus 107. Further, withregard to the stream titled “Querying Apparatus,” a similarconfiguration instruction set 903 is provided to the querying apparatuswhich may be, for example, the previously illustrated apparatus 106.This configuration instructions set 903 is processed through theexecution of an operation 904, such that an apparatus (e.g., apparatus106) may have certain coverage parameters and query methods that are setfor the apparatus. Similarly, through the execution of operation 902,the broadcasting apparatus (e.g., apparatus 107) may have certaincoverage parameters and query method set for the apparatus. Once theconfiguration instructions are provided to the broadcasting apparatus(e.g., apparatus 107) and the querying apparatus (e.g., apparatus 106),the querying apparatus may be then generate a query such as networkaddress query 111.

Further, illustrated is a transmit query operation 926 which, whenexecuted, generates a query 905. This query 905 may be akin to, forexample, the network address query 111. Once generated, this query 905is received by the broadcasting apparatus through the execution of anoperation 906. When executed, the operation 906 extracts a networkaddress with regard to which the query is made. This network address isthen provided to an operation 907 that looks up the address in a routingtable 908. Once look up occurs, a further operation 909 is executed thatretrieves configuration parameters and sets various terminationconditions based upon the configuration instructions 901. Next, adecisional operation 920 is executed that determines whether or notcertain termination conditions have been met, and determines a secondnetwork address based upon the network address query. These terminationconditions may include meeting a certain minimal coverage value relativeto a prefix value such that certain gaps in the addresses listed in therouting table 908 are filled. In other examples, an empty packet,anon-response, or some other suitable condition may form the basis of atermination condition.

In examples where decisional operation 920 evaluates to “false,” anoperation 910 is executed. When executed, the operation 910 transmits anaddress query to the various apparatuses that are operatively connectedto, for example, the apparatus 107. These apparatus may include, forexample, the previously illustrated apparatus 108, and/or apparatus 109.This address query generated by the execution of operation 910 may be inthe form of, for example, an network address query 911 that may be akinto, for example, the previously shown network address queries 112. Thenetwork address in query 911 is then received through the execution ofan operation 912 residing as part of one of the apparatus e.g., anapparatus 108) operatively connected to the apparatus 107. The operation912 extracts the address included within the network address query 911,and an operation 913 is executed that performs a look up in a routingtable 914 residing on the apparatus. Next, a decisional operation 915 isexecuted that determines whether or not the network address is in therouting table 914. If decisional operation 915 evaluates to “false,”then no further operations are executed on the apparatus, and anoperation 916 is executed that forwards the query 911 onto anotherapparatus. The execution of operation 916 is reflected in, for example,the forwarding of a query from one apparatus to another (see e.g., query201 being forwarded from an apparatus 107 to apparatus 109, and thenagain from an apparatus 109 to an apparatus 110). In examples wheredecisional operation 915 evaluates to “true,” a further operation 917 isexecuted that transmits a response 918 to the network address query 911.In some example embodiments, the response 918 may be akin to, forexample, the previously illustrated response 114. This response 918 isthen received through the execution of an operation 919 that receivesthis response 918 and parses the response 918 to determine the address.In some example embodiments, this operation 919 may store (not pictured)the address parsed from the response 918 into the routing table 908.Once the response 918 is parsed, the decisional operation 920 isre-executed and the existence of a termination condition is determined.In certain examples, the response 918 includes an empty packet denotingthat no further address information is available, thus constituting atermination condition. In other examples, no response may be receivedthus constituting a termination condition.

In examples where decisional operation 920 evaluates to “true,” then afurther operation 921 is executed that advertises a response 922 to theinitial query 905, wherein this response 922 includes an aggregatevalue. This response 922 is akin to previously illustrated response 303.This response 922 is received through the execution of an operation 923that resides on the querying apparatus. This operation 923 not onlyreceives the response 922, but extracts the now shortened networkaddress value (e.g., the aggregate value). Next, an operation 924 isexecuted that updates a routing table 925. This updating process, whichwill be more fully shown below, takes this aggregate value, compares theaggregate value to the initial query value included in query 905, andthen installs the initial query value in the routing table 925.

FIG. 10 is a diagram of an example configuration instruction set 903.Illustrated in FIG. 10 is a configuration of instruction set 903 whichmay be written in, for example, an eXtensibie Markup Language (XML) or,for example, as a flat file delimited with some character value, orembedded in the apparatus. Here, the configuration instruction set 903is written in XML, and includes a number of fields. These fieldsinclude, for example, a field 1001 that includes a boolean value as towhether or not all missing addresses in a routing table should bebroadcast at once. Here, this value is set to “no.” Next, a field 1002is illustrated including a shortest prefix length value which here is26. The shortest prefix length value may reference, for example, ashortest prefix in terms of the shortest number of prefix bits that maybe returned in response to an initial query such as network addressquery 111. For example, in the network address query 111, the returnedaddress value (e.g., response 303) may have a prefix which may be noshorter than 26 bits. Further, illustrated is a field 1003 that includesa minimal coverage value, which here is set to 100. In some examples, aminimum percentage coverage value may be provided to an apparatus suchthat the range of network values generated using the aggregate value maybe, for example, 100%. By way of illustration, in the previouslydiscussed example response 303 including the aggregate value10.1.1.64/30, assuming a coverage value set to 100%, means that addressvalues 10.1.1.64 through 10.1.1.67 may be reachable through theapparatus 107. If, however, a minimal coverage value was set to 50% thenthe values 10.1.1.64 through 10.1.1.65 would have to be reachablethrough the apparatus 107. The concept of minimal coverage value will bemore fully shown and illustrated below.

FIG. 11 is a flowchart illustrating an example method used to implementoperation 1110. Shown are various operations 1101-1103. In some exampleembodiments, an operation 1101 receives addresses from a routing table.Once received, an operation 1102 is executed that determines a missingaddress, where the missing address may be the smallest and closestaddress (e.g., having the closest value) to the received address, oraddresses. For example, if an initial query such a network address query111 seeks address information with regard to the address 10.1.1.65, thenthe next smallest address would be for example 10.1.1.64. This addressis both the closest value and this address may be missing from therouting table associated with apparatus 107. Once this next closest andsmallest address are determined, an operation 1103 is executed thattransmits an address query to an apparatus operatively connected to theapparatus upon which operation 1110 resides. This transmitted addressquery may be akin to, for example, the previously illustrated query 112,201, 301, 409, or 410.

FIG. 12 is a flowchart illustrating an example method used to implementoperation 910. Shown are various operations 1201-1203. Some exampleembodiments may include an operation 1201 that receives addresses from amuting table. Once received, an operation 1202 is executed thatdetermines missing addresses, or, in some examples, gaps in the receivedaddresses. For example, if the address 10.1.1.65 is received, and asecond address of 10.1.1.70 is received, then a gap would exist betweenthese two values such that the values 10.1.1.66 through 10.1.1.69 wouldbe unknown. These unknown values would then, in some examples, need tobe determined. Once operation 1202 is executed, operation 1202determines what gaps exist in the addresses that are received from therouting table. An operation 1203 is then executed that transmits anaddress query for all these missing addresses. This address query may besimilar to, for example, the address query 911, or even the variousaddress queries previously shown in FIGS. 1 through 4 (e.g., addressquery 112, 201, 301, 409, and 410).

FIG. 13 is a flowchart illustrating an example method used to executeoperation 920. Shown are various operations 1301-4305. Illustrated is aparsed prefix 1301 that is received and processed through the executionof an operation 1302 that stores the parsed prefix 1301 into the routingtable 908. Next, a decisional operation 1303 is executed. Thisdecisional operation 1303 determines a shortest prefix value relative toa minimal coverage value (e.g., a minimal coverage parameter). Incertain examples, decisional operation 1303 may be recursive oriterative in nature wherein the termination condition may be the lack ofa response by an apparatus to, for example, the address query 911, oreven address queries 112, 201, 301, 409, and 410. In certain examples,the receipt of an empty packet may form the basis for termination. Insome examples, decisional operation 1302 may terminate where a shortestprefix length value is met (see e.g., shortest prefix value 802).Further, the termination condition may be met where a minimal coverageparameter is met. In examples where the decisional operation evaluatesto “true,” then an operation 1304 is executed that forwards the parsedprefix as an aggregate value to be advertised (see e.g., response 303,response 414, and response 922). The aggregate value generated using thedecrementing operation is illustrated below, and may include less thanor equal to the number of bits used to make up the initial address query(e.g., network address query 111, or query 905). In examples wheredecisional operation 1303 evaluates to “false” (e.g., the shortestprefix value relative to the minimal coverage parameter has not beendiscovered), then an operation 1305 is executed that decrements theparsed prefix value 1301 by one or more bits. This operation 1305, ineffect, generates a further network address based upon a network addressquery.

The concept of a minimal coverage value may be illustrated in thefollowing example. A coverage parameter of 100% requires that alladdress values for a given range of address values must be discovered.Discovery may occur as a result of the generation of queries andresponses shown in, for example, FIG. 9. If the range of address valuesis between 10.1.1.64/32, and 10.1.1.67/32 inclusive, then these and allintervening address values (e.g., 10.1.1.65/32, and 10.1.1.66/32,) wouldneed to be discovered. If only two of the addresses were discovered,then a 50% coverage parameter would be realized. If only three of theaddresses were discovered, then a 75% coverage parameter would berealized. As previously alluded to a termination condition may be, forexample, when the coverage percentage rises to the level of 100%.

FIG. 14 is a flowchart illustrating an example method used to executeoperation 924. Shown are various operations 1402-1403, 1405-1408, and aquery prefix store 1404. Illustrated in FIG. 14 is a prefix value andsize data packet 1401, where this prefix value may be, for example, thepreviously illustrated aggregate value. This data packet 1401 isprovided to and retrieved by an execution of operation 1402. In someexamples, this data packet 201 may include some type of binary value.Next, an operation 1403 is executed that retrieves the initial queryfrom a query prefix store 1404. This initial query may be, for example,the network address query 111, or even the network address query 408.Once this initial query is retrieved, a decisional operation 1405 isexecuted that determines whether the prefix size is valid. In someexample embodiments, the initial query, and value included therein, iscompared to the aggregate value using some type of logical operationsuch as a logical AND operation. A valid prefix size may exist wherethrough the utilization of this logical AND operation, the initial queryvalue, or a prefix associated with the initial query value, is returned.In examples where decisional operation 1405 evaluates to “false,” anerror condition 1406 is executed. In examples where decisional operation1405 evaluates to “true,” then an operation 1407 is executed. Decisionaloperation 1405 may evaluate to “true”, where, for example, the aggregatevalue, and prefix associated therewith, corresponds to the initial queryvalue. This operation 1407 installs an aggregate value into a routingtable such as routine table 908. Next, an operation 1408 is executedthat deletes the record of the initial query from the query prefix store1404.

Some example embodiments may utilize the OSI model, or TCP/IP stackmodel for defining the protocols used by a network to transmit data. Inapplying these models, a system of data transmission between a serverand client, or between peer computer systems, is illustrated as a seriesof approximately five layers comprising: an application layer, atransport layer, a network layer, a data link layer, and a physicallayer. In examples of software having a three-tier architecture, thevarious tiers (e.g., the interface, logic, and storage tiers) reside onthe application layer of the TCP/IP protocol stack. In an exampleimplementation using the TCP/IP protocol stack model, data from anapplication residing at the application layer is loaded into the dataload field of a TCP segment residing at the transport layer. This TCPsegment also includes port information for a recipient softwareapplication residing remotely. This TCP segment is loaded into the dataload field of an IP datagram residing at the network layer. Next, thisIP datagram is loaded into a frame residing at the data link layer. Thisframe is then encoded at the physical layer, and the data transmittedover a network such as an Internet, Local Area Network (LAN), Wide AreaNetwork (WAN), or some other suitable network. In some examples,Internet refers to a network of interconnected computer networks. Thesenetworks may use a vane of protocols for the exchange of data, includingthe aforementioned TCP/IP, and additionally ATM, SNA, SDI, or some othersuitable protocol. These networks may be organized within a variety oftopologies (e.g., a star topology), or structures.

In some example embodiments, when information is transferred or providedover a network or another communications connection (e.g., eitherhardwired, wireless, or a combination of hardwired or wireless) to acomputer system, the connection is properly viewed as acomputer-readable medium. Thus, any such connection is properly termed acomputer-readable medium. Combinations of the above should also beincluded within the scope of computer-readable medium.Computer-executable or computer-readable instructions comprise, forexample, instructions and data that cause a general-purpose computersystem or special-purpose computer system to perform a certain functionor group of functions. The computer-executable or computer-readableinstructions may be, for example, binaries, or intermediate formatinstructions such as assembly language, or even source code.

As shown herein, and in the following claims, a computer system isdefined as one or more software modules, one or more hardware modules,or combinations thereof, that work together to perform operations onelectronic data. For example, the definition of computer system includesthe hardware modules of a personal computer, as well as softwaremodules, such as the operating system of the personal computer. Thephysical layout of the modules is not important. A computer system mayinclude one or more computers coupled via a network. Likewise, acomputer system may include a single physical device (e.g., a mobilephone or PDA) where internal modules (e.g., a processor and memory) worktogether to perform operations on electronic data.

In some example embodiments, the method and apparatus may be practicedin network computing environments with many types of computer systemconfigurations, including hubs, routers, wireless Access Points (APs),wireless stations, personal computers, laptop computers, hand-helddevices, multi-processor systems, microprocessor-based or programmableconsumer electronics, network PCs, minicomputers, mainframe computers,mobile telephones, PDAs, pagers, and the like. The method and apparatuscan also be practiced in distributed system environments where local andremote computer systems, which are linked (i.e., either by hardwired,wireless, or a combination of hardwired and wireless connections)through a network, both perform tasks. In a distributed systemenvironment, program modules may be located in both local and remotememory-storage devices (see below).

FIG. 15 shows a diagrammatic representation of machine in the exampleform of a computer system 1500 within which a set of instructions, forcausing the machine to perform any one or more of the methodologiesdiscussed herein, may be executed. In alternative example embodiments,the machine operates as a standalone device or may be connected (e.g.,networked) to other machines. In a networked deployment, the machine mayoperate in the capacity of a server or a client machine in server-clientnetwork environment, or as a peer machine in a peer-to-peer (ordistributed) network environment. The machine may be a Personal Computer(PC), a web appliance, a network router, switch, or bridge, or anymachine capable of executing a set of instructions (sequential orotherwise) that specify actions to be taken by that machine. Further,while only a single machine is illustrated, the term “machine” shallalso be taken to include any collection of machines that individually orjointly execute a set (or multiple sets) of instructions to perform anyone or more of the methodologies discussed herein.

The example computer system 1500 includes a processor 1502 (e.g., aCentral Processing Unit (CPU), a Graphics Processing Unit (GPU) orboth), a main memory 1501 and a static memory 1506, which communicatewith each other via a bus 1508. The computer system 1500 may furtherinclude a video display unit 1510 (e.g., a LCD or a CRT). The computersystem 1500 also includes an alphanumeric input device 1517 (e.g., akeyboard), a user interface (UI) cursor controller 1511 (e.g., a mouse),a disk drive unit 1516, a signal generation device 1514 (e.g., aspeaker) and a network interface device (e.g., a transmitter) 1520.

The disk drive unit 1516 includes a machine-readable medium 1522 onwhich is stored one or more sets of instructions and data structures(e.g., software) 1521 embodying or utilized by any one or more of themethodologies or functions illustrated herein. The software may alsoreside, completely or at least partially, within the main memory 1501and/or within the processor 1502 during execution thereof by thecomputer system 1500, the main memory 1501 and the processor 1502 alsoconstituting machine-readable media.

The instructions 1521 may further be transmitted or received over anetwork 1526 via the network interface device 1520 using any one of anumber of well-known transfer protocols e.g., Hyper-Text TransferProtocol (HTTP), Session Initiation Protocol (SIP)).

While the machine-readable medium 1522 is shown in an example embodimentto be a single medium, the term “machine-readable medium” should betaken to include a single medium or multiple media (e.g., a centralizedor distributed database, and/or associated caches and servers) thatstores the one or more sets of instructions. The term “machine-readablemedium” shall also be taken to include any medium that is capable ofstoring, encoding, or carrying a set of instructions for execution bythe machine and that cause the machine to perform any one or more of themethodologies of the present method and apparatus, or that is capable ofstoring, encoding, or carrying data structures utilized by or associatedwith such a set of instructions. The term “machine-readable medium”shall accordingly be taken to include, but not be limited to,solid-state memories, optical and magnetic media, and carrier wavesignals.

It is to be understood that the above description is intended to beillustrative, and not restrictive. Although numerous characteristics andadvantages of various embodiments as illustrated herein have been setforth in the foregoing description, together with details of thestructure and function of various embodiments, many other embodimentsand changes to details may be apparent to those of skill in the art uponreviewing the above description. The scope of the method and apparatusshould be, therefore, determined with reference to the appended claims,along with the full scope of equivalents to which such claims areentitled. In the appended claims, the terms “including” and “in which”are used as the plain-English equivalents of the respective terms“comprising” and “wherein,” respectively. Moreover, the terms “first,”“second,” and “third,” etc., are used merely as labels, and are notintended to impose numerical requirements on their objects.

The Abstract of the Disclosure is provided to comply with 37 C.F.R.§1.72(b), requiring an abstract that may allow the reader to quicklyascertain the nature of the technical disclosure. It is submitted withthe understanding that it may not be used to interpret or limit thescope or meaning of the claims. In addition, in the foregoingDescription of Example Embodiments, it can be seen that various featuresare grouped together in a single embodiment for the purpose ofstreamlining the disclosure. This method of disclosure is not to beinterpreted as reflecting an intention that the claimed embodimentsrequire more features than are expressly recited in each claim. Rather,as the following claims reflect, inventive subject matter lies in lessthan all features of a single disclosed embodiment. Thus the followingclaims are hereby incorporated into the Detailed Description, with eachclaim standing on its own as a separate embodiment.

1-19. (canceled)
 20. A method comprising: at a routing device in acomputer network, receiving a network address query with respect to adestination address; at the routing device, determining an advertisementvalue representing a network address range that includes the destinationaddress, the determining of the advertisement value comprising:calculating a coverage value that indicates a portion of addresseswithin the network address range that can be reached through the routingdevice, and determining that the calculated coverage value meets orexceeds a predefined threshold coverage value; and replying to thenetwork address query by advertising the advertisement value.
 21. Themethod of claim 20, further comprising: at the routing device, receivinga second network address query with respect to a second destinationaddress; at the routing device, determining a candidate advertisementvalue representing a second network address range that includes thesecond destination address; calculating a second coverage value thatindicates a respective portion of addresses within the second networkaddress range that can be reached through the routing device;determining that the second coverage value is smaller than thepredefined threshold coverage value; and based on the determination thatthe second coverage value smaller than the predefined threshold coveragevalue, replying to the second network address query by advertising avalue other than the candidate advertisement value.
 22. The method ofclaim 20, wherein the determining of the advertisement value comprisesidentifying from a local routing table of the routing device one or moreaddresses which are within the network address range and for which therouting device does not have reachability information that indicateswhether or not the respective addresses can be reached via the routingdevice.
 23. The method of claim 22, further comprising, in response tothe identifying of the one or more addresses, sending one or morequeries from the routing device with respect to the one or moreaddresses, to determine whether or not the one or more addresses can bereached via a routing device.
 24. The method of claim 20, wherein thedetermining of the advertisement value further comprises: identifying acandidate aggregate value representing a larger range of networkaddresses than the network address range corresponding to theadvertisement value, the larger range of network addresses including thedestination address; calculating a candidate coverage value thatindicates a respective portion of addresses within the larger range ofnetwork addresses that can be reached through the routing device; anddetermining that the candidate coverage value is smaller than thepredefined threshold coverage value.
 25. The method of claim 20, whereinthe advertisement value is a network address prefix, the determining ofthe advertisement value comprising identifying a shortest networkaddress prefix of which the corresponding coverage value meets orexceeds the predefined threshold coverage value.
 26. The method of claim25, wherein the determining of the advertisement value comprisesrecursively determining whether or not progressively shorter networkaddress prefixes corresponding to progressively larger network addressranges have respective coverage values that meet or exceed thepredefined threshold coverage value.
 27. The method of claim 20, whereinthe predefined threshold coverage value is a threshold proportion ofaddresses within the network address range that are reachable via therouting device.
 28. The method of claim 27, wherein the thresholdproportion is 100%.
 29. The method of claim 27, wherein the thresholdproportion is less than 100%.
 30. A routing device comprising: a firstreceiver configured to receive, in a reactive routing environment, anetwork address query with respect to a destination address; acalculation engine configured to determine an advertisement valuerepresenting a network address range that includes the destinationaddress the calculation engine being configured to determine theaggregate value by performing operations comprising: calculating acoverage value that indicates a portion of addresses within the networkaddress range that can be reached through the routing device, anddetermining that the calculated coverage value meets or exceeds apredefined threshold coverage value; and an advertising engineconfigured to reply to the network address query by advertising theadvertisement value.
 31. The routing device of claim 30, wherein: thefirst receiver is further configured to receive a second network addressquery with respect to a second destination address; the calculationengine is further configured to determine a candidate advertisementvalue representing a second network address range that includes thesecond destination address, the calculation engine being configured todetermine the candidate advertisement value by performing operationscomprising; calculating a second coverage value that indicates arespective portion of addresses within the second network address rangethat can be reached through the routing device, and determining that thesecond coverage value is smaller than the predefined threshold coveragevalue; and the advertising engine is further configured to reply to thesecond network address query by advertising a value other than thecandidate advertisement value, based on the determination that thesecond coverage value is smaller than the predefined threshold coveragevalue.
 32. The routing device of claim 30, wherein the calculationengine is further configured such that the operations for determiningthe candidate advertisement value comprises identifying from a localrouting table of the routing device one or more addresses which arewithin the network address range and for which the routing device doesnot have reachability information that indicates whether or not therespective addresses can be reached via the routing device.
 33. Therouting device of claim 32, further comprising a transmitter configuredto send, in response to the identifying of the one or more addresses,one or more queries with respect to the one or more addresses, todetermine whether or not the one or more addresses can be reached via arouting device.
 34. The routing device of claim 30, wherein thecalculation engine is configured such that the operations fordetermining the candidate advertisement value further comprises:identifying a candidate aggregate value representing a larger range ofnetwork addresses than the network address range corresponding to theadvertisement value, the larger range of network addresses including thedestination address; calculating a candidate coverage value thatindicates a respective portion of addresses within the larger range ofnetwork addresses that can be reached through the routing device; anddetermining that the candidate coverage value is smaller than thepredefined threshold coverage value.
 35. The routing device of claim 30,wherein the advertisement value is a network address prefix, thecalculation engine being configured such that the operations fordetermining the advertisement value comprises identifying a shortestnetwork address prefix of which the corresponding coverage value meetsor exceeds the predefined threshold coverage value.
 36. The routingdevice of claim 35, wherein the calculation engine is configured suchthat the operations for determining the advertisement value recursivelydetermining whether or not progressively shorter network addressprefixes corresponding to progressively larger network address rangeshave respective coverage values that meet or exceed the predefinedthreshold coverage value.
 37. The routing device of claim 30, whereinthe predefined threshold coverage value is a threshold proportion ofaddresses within the network address range that are reachable via therouting device.
 38. A non-transitory computer readable storage mediumincluding instructions for causing a routing device, when theinstructions are executed by the routing device, to perform operationscomprising: in a computer network, receive a network address query withrespect to a destination address; determine an advertisement valuerepresenting a network address range that includes the destinationaddress, the determining of the advertisement value comprising:calculating a coverage value that indicates a portion of addresseswithin the network address range that can be reached through the routingdevice, and determining that the calculated coverage value meets orexceeds a predefined threshold coverage value; and reply to the networkaddress query by advertising the advertisement value.